Entropic definitions of anonymity
نویسنده
چکیده
Syverson points out the security of anonymous communication systems is most often characterized by indistinguishability among a set of honest parties in a protocol. In the entropist conception, we may quantify the security of a protocol in terms of the size of the set. According to Syverson, the number of ORs (“onion routers”) in the Tor network is most often used to quantify its security [3]. This relates to maximum entropy in the following:
منابع مشابه
Anonymity and Information Hiding in Multiagent Systems
We provide a framework for reasoning about information-hiding requirements in multiagent systems and for reasoning about anonymity in particular. Our framework employs the modal logic of knowledge within the context of the runs and systems framework, much in the spirit of our earlier work on secrecy [Halpern and O’Neill 2002]. We give several definitions of anonymity with respect to agents, act...
متن کاملAnonymity and CSP for Voting Systems
In this paper, we present a concise formal definition of anonymity for voting protocols using process algebra Communicating Sequential Processes (CSP). We analyse a number of anonymity definitions and give the formal definitions for the strong and weak anonymity highlighting the difference between them. It shows us that the strong anonymity definition is not an appropriate definition as it is t...
متن کاملk-Anonymous Decision Tree Induction
In this paper we explore an approach to privacy preserving data mining that relies on the k-anonymity model. The k-anonymity model guarantees that no private information in a table can be linked to a group of less than k individuals. We suggest extended definitions of k-anonymity that allow the k-anonymity of a data mining model to be determined. Using these definitions, we present decision tre...
متن کاملEntropic security in quantum cryptography
We present two new definitions of security for quantum ciphers which are inspired by the definition of entropic security and entropic indistinguishability defined by Dodis and Smith. We prove the equivalence of these two new definitions. We also propose a generalization of a cipher described by Dodis and Smith and show that it can actually encrypt n qubits using less than n bits of key under re...
متن کاملAnoA: A Framework For Analyzing Anonymous Communication Protocols Unified Definitions and Analyses of Anonymity Properties
Protecting individuals’ privacy in online communications has become a challenge of paramount importance. To this end, anonymous communication (AC) protocols such as the widely used Tor network have been designed to provide anonymity to their participating users. While AC protocols have been the subject of several security and anonymity analyses in the last years, there still does not exist a fr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015